Tootfinder

Visual experiences unique to early infancy provide building blocks of human vision https://medicalxpress.com/news/2024-05-visual-unique-early-infancy-blocks.html "the same sequence of images improves the training of

Visual experiences unique to early infancy provide building blocks of human vision, study finds
What do infants see? What do they look at? The answers to these questions are very different for the youngest babies than they are for older infants, children and adults. Characterized by a few high-contrast edges in simple patterns, these early scenes also contain the very materials needed to build a strong foundation for human vision.

Minimal hyperbolic polynomials and ranks of homogeneous cones
Jo\~ao Gouveia, Masaru Ito, Bruno F. Louren\c{c}o
https://arxiv.org/abs/2404.03860 https://…

Minimal hyperbolic polynomials and ranks of homogeneous cones
The starting point of this paper is the computation of minimal hyperbolic polynomials of duals of cones arising from chordal sparsity patterns. From that, we investigate the relation between ranks of homogeneous cones and their minimal polynomials. Along the way, we answer in the negative a question posed in an earlier paper and show examples of homogeneous cones that cannot be realized as rank-one generated (ROG) hyperbolicity cones.

On the permutations that strongly avoid the pattern 312 or 231
Junyao Pan, Pengfei Guo
https://arxiv.org/abs/2404.01597 https://arxiv…

On the permutations that strongly avoid the pattern 312 or 231
In 2019, Bóna and Smith introduced the notion of \emph{strong pattern avoidance}, that is, a permutation and its square both avoid a given pattern. In this paper, we enumerate the set of permutations $π$ which not only strongly avoid the pattern $312$ or $231$ but also avoid the pattern $τ$, for $τ\in S_3$ and some $τ\in S_4$. One of them is to give a positive answer to a conjecture of Archer and Geary.

Scaling Population-Based Reinforcement Learning with GPU Accelerated Simulation
Asad Ali Shahid, Yashraj Narang, Vincenzo Petrone, Enrico Ferrentino, Ankur Handa, Dieter Fox, Marco Pavone, Loris Roveda
https://arxiv.org/abs/2404.03336

Scaling Population-Based Reinforcement Learning with GPU Accelerated Simulation
In recent years, deep reinforcement learning (RL) has shown its effectiveness in solving complex continuous control tasks like locomotion and dexterous manipulation. However, this comes at the cost of an enormous amount of experience required for training, exacerbated by the sensitivity of learning efficiency and the policy performance to hyperparameter selection, which often requires numerous trials of time-consuming experiments. This work introduces a Population-Based Reinforcement Learning (…

Help save democracy, or something that resembles it.
Support daily nourishing news and satisfying actions.
Have a say about the direction of the earlyworm society.
Get your questions about democracy, elections, and voting rights answered.
https://www.patreon.com/EarlyWormSociety

the earlyworm society | Patreon
Satisfying ways to feed democracy, from @LOLGOP and Nick.

Internal Pattern Matching in Small Space and Applications
Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya
https://arxiv.org/abs/2404.17502

Internal Pattern Matching in Small Space and Applications
In this work, we consider pattern matching variants in small space, that is, in the read-only setting, where we want to bound the space usage on top of storing the strings. Our main contribution is a space-time trade-off for the Internal Pattern Matching (IPM) problem, where the goal is to construct a data structure over a string $S$ of length $n$ that allows one to answer the following type of queries: Compute the occurrences of a fragment $P$ of $S$ inside another fragment $T$ of $S$, provide…

This https://arxiv.org/abs/2301.11580 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csGT_…

A Characterization of Complexity in Public Goods Games
We complete the characterization of the computational complexity of equilibrium in public goods games on graphs. In this model, each vertex represents an agent deciding whether to produce a public good, with utility defined by a "best-response pattern" determining the best response to any number of productive neighbors. We prove that the equilibrium problem is NP-complete for every finite non-monotone best-response pattern. This answers the open problem of [Gilboa and Nisan, 2022], and complete…

Scaling Population-Based Reinforcement Learning with GPU Accelerated Simulation
Asad Ali Shahid, Yashraj Narang, Vincenzo Petrone, Enrico Ferrentino, Ankur Handa, Dieter Fox, Marco Pavone, Loris Roveda
https://arxiv.org/abs/2404.03336

Scaling Population-Based Reinforcement Learning with GPU Accelerated Simulation
In recent years, deep reinforcement learning (RL) has shown its effectiveness in solving complex continuous control tasks like locomotion and dexterous manipulation. However, this comes at the cost of an enormous amount of experience required for training, exacerbated by the sensitivity of learning efficiency and the policy performance to hyperparameter selection, which often requires numerous trials of time-consuming experiments. This work introduces a Population-Based Reinforcement Learning (…

This https://arxiv.org/abs/2206.09032 has been replaced.
link: https://scholar.google.com/scholar?q=a

Conjunctive Queries with Free Access Patterns under Updates
We study the problem of answering conjunctive queries with free access patterns (CQAP) under updates. A free access pattern is a partition of the free variables of the query into input and output. The query returns tuples over the output variables given a tuple of values over the input variables. We introduce a fully dynamic evaluation approach for CQAP queries. We also give a syntactic characterisation of those CQAP queries that admit constant time per single-tuple update and whose output tu…

Pattern-restricted permutations of small order
Kassie Archer, Robert P. Laudone
https://arxiv.org/abs/2402.15463 https://arxiv.org/pd…

Pattern-restricted permutations of small order
We enumerate 132-avoiding permutations of order 3 in terms of the Catalan and Motzkin generating functions, answering a question of Bóna and Smith from 2019. We also enumerate 231-avoiding permutations that are composed only of 3-cycles, 2-cycles, and fixed points.